Fast Sweeping Methods for Factored Anisotropic Eikonal Equations: Multiplicative and Additive Factors

نویسندگان

  • Songting Luo
  • Jianliang Qian
چکیده

The viscosity solution of static Hamilton-Jacobi equations with a pointsource condition has an upwind singularity at the source, which makes all formally high-order finite-difference scheme exhibit first-order convergence and relatively large errors. To obtain designed high-order accuracy, one needs to treat this source singularity during computation. In this paper, we apply the factorization idea to numerically compute viscosity solutions of anisotropic eikonal equations with a point-source condition. The idea is to factor the unknown traveltime function into two functions, either additively or multiplicatively. One of these two functions is specified to capture the source singularity so that the other function is differentiable in a neighborhood of the source. Then we design monotone fast sweeping schemes to solve the resulting factored anisotropic eikonal equation. Numerical examples show that the resulting monotone schemes indeed yield clean first-order convergence rather than polluted first-order convergence and both factorizations are able to treat the source singularity successfully.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

High-Order Factorization Based High-Order Hybrid Fast Sweeping Methods for Point-Source Eikonal Equations

The solution for the eikonal equation with a point-source condition has an upwind singularity at the source point as the eikonal solution behaves like a distance function at and near the source. As such, the eikonal function is not differentiable at the source so that all formally high-order numerical schemes for the eikonal equation yield first-order convergence and relatively large errors. Th...

متن کامل

Fast sweeping method for the factored eikonal equation

We develop a fast sweeping method for the factored eikonal equation. By decomposing the solution of a general eikonal equation as the product of two factors: the first factor is the solution to a simple eikonal equation (such as distance) or a previously computed solution to an approximate eikonal equation. The second factor is a necessary modification/correction. Appropriate discretization and...

متن کامل

A uniformly second order fast sweeping method for eikonal equations

A uniformly second order method with a local solver based on the piecewise linear discontinuous Galerkin formulation is introduced to solve the eikonal equation with Dirichlet boundary conditions. The method utilizes an interesting phenomenon, referred as the superconvergence phenomenon, that the numerical solution of monotone upwind schemes for the eikonal equation is first order accurate on b...

متن کامل

A fast marching algorithm for the factored eikonal equation

The eikonal equation is instrumental in many applications in several fields ranging from computer vision to geoscience. This equation can be efficiently solved using the iterative Fast Sweeping (FS) methods and the direct Fast Marching (FM) methods. However, when used for a point source, the original eikonal equation is known to yield inaccurate numerical solutions, because of a singularity at ...

متن کامل

Uniformly Accurate Discontinuous Galerkin Fast Sweeping Methods for Eikonal Equations

In [F. Li, C.-W. Shu, Y.-T. Zhang, H. Zhao, Journal of Computational Physics 227 (2008) 81918208], we developed a fast sweeping method based on a hybrid local solver which is a combination of a discontinuous Galerkin (DG) finite element solver and a first order finite difference solver for Eikonal equations. The method has second order accuracy in the L norm and a very fast convergence speed, b...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Sci. Comput.

دوره 52  شماره 

صفحات  -

تاریخ انتشار 2012